Algebraic structures computable without delay
نویسندگان
چکیده
منابع مشابه
Algebraic structures computable without delay
In this article we suggest a new systematic approach to studying algorithms on algebraic structures via primitive recursion. The approach is designed to fill the gap between abstract computable structure theory and feasible (in the sense of polynomial-time, computational or automatic) algebra.
متن کاملDegree spectra and computable dimensions in algebraic structures
Whenever a structure with a particularly interesting computability-theoretic property is found, it is natural to ask whether similar examples can be found within well-known classes of algebraic structures, such as groups, rings, lattices, and so forth. One way to give positive answers to this question is to adapt the original proof to the new setting. However, this can be an unnecessary duplica...
متن کاملLocally Computable Structures
We introduce the notion of a locally computable structure, a natural way of generalizing the notions of computable model theory to uncountable structures S by presenting the finitely generated substructures of S effectively. Our discussion emphasizes definitions and examples, but does prove two significant results. First, our notion of mextensional local computability of S ensures that the Σn-t...
متن کاملRelations on computable structures
Gődel’s incompleteness theorem from 1931 is an astonishing early result of computable mathematics. Gődel showed that “there are in fact relatively simple problems in the theory of ordinary whole numbers which cannot be decided from the axioms.” The work of Gődel, Turing, Kleene, Church, Post and others in the mid-1930’s established the rigorous mathematical foundations for the computability the...
متن کاملEmbeddings of Computable Structures
We study what the existence of a classical embedding between computable structures implies about the existence of computable embeddings. In particular, we consider the effect of fixing and varying the computable presentations of the computable structures.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2017
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2017.01.029